Welcome![Sign In][Sign Up]
Location:
Search - salesman annealing

Search list

[matlabCodes

Description: Simulated Annealing, Traveling Salesman Problem,
Platform: | Size: 4096 | Author: poch14 | Hits:

[Algorithmliangzisuichuansuanfa

Description: 粒子势垒隧穿算法,与退火原理基本一样,这是解决旅行商问题的源代码。-Particle tunneling barrier algorithm, and annealing the same basic principle, which is to solve the traveling salesman problem' s source code.
Platform: | Size: 3072 | Author: cmz | Hits:

[OtherSA-TSP

Description: 使用模拟退火算法来解决TSP旅行商优化问题-Using simulated annealing algorithm to solve TSP traveling salesman optimization problem
Platform: | Size: 175104 | Author: 乔兵 | Hits:

[File Formatant-algorithms-of-vrp

Description: 采用蚁群算法能够解决31个城市的旅行商问题,相对于遗传算法,模拟退火算法和其他的算法,蚁群算法有其自身的优势-Ant colony algorithm to solve the traveling salesman problem 31 cities, with respect to genetic algorithms, simulated annealing algorithm and other algorithms, ant colony algorithm has its own advantages
Platform: | Size: 2048 | Author: 董乾东 | Hits:

[CSharpSA_Tsp

Description: 模拟退火旅行商问题用C#语言编写的,有界面计算城市之间旅行最短行程问题-Simulated annealing traveling salesman problem written in C# language, the interface to calculate the shortest path problem traveling between cities
Platform: | Size: 26508288 | Author: jason | Hits:

[Data structssa

Description: 本程序是运用模拟退火算法解决旅行商问题,求解最短路径,C语言程序-This procedure is to use simulated annealing algorithm to solve the traveling salesman problem, solving the shortest path, C language program
Platform: | Size: 10240 | Author: zero5885 | Hits:

[transportation applicationstuihuo

Description: 用退火算法实现旅行商问题。问题的解不唯一。不一定是最优解。-Solve Traveling salesman problem with annealing algorithm.
Platform: | Size: 7705600 | Author: James | Hits:

[OtherSA_TSP

Description: 模拟退火算法做的来处理的旅行商问题,可以参考下,但希望不要直接用。-Simulated annealing algorithm to deal with the traveling salesman problem, you can refer to, but I hope not to use directly.
Platform: | Size: 3072 | Author: jim lu | Hits:

[Algorithmtspsa

Description: 旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Simulated annealing algorithm
Platform: | Size: 616448 | Author: free | Hits:

[AI-NN-PRmonituihuofaTSP

Description: 利用模拟退火法进行旅行商问题的求解,能够快速得到最优解-Conducted using simulated annealing traveling salesman problem solving
Platform: | Size: 2048 | Author: Bill | Hits:

[matlabSA_TSPproblem

Description: TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序-TSP problem (traveling salesman problem, traveling salesman problem) simulated annealing algorithm malab common source
Platform: | Size: 1024 | Author: yjm | Hits:

[Consolea

Description: 模拟退火求解旅行商问题,命令行输入格式为: 程序名 输入文件名 输出文件名-Simulated Annealing Traveling Salesman Problem, the command line input format: program name Enter the file name of the output file name
Platform: | Size: 16384 | Author: 黄予 | Hits:

[matlabSA_TSP

Description: 模拟退火算法求解旅行商问题的Matlab源程序-Simulated annealing algorithm for traveling salesman problem Matlab source
Platform: | Size: 3072 | Author: pan dazhi | Hits:

[AI-NN-PRSA_solve_TSP

Description: 模拟退火算法解决旅行商问题,操作步骤详见readme.txt-Simulated annealing algorithm to solve the traveling salesman problem, the steps described in Readme.txt
Platform: | Size: 292864 | Author: 刘峰 | Hits:

[Dialog_WindowSA

Description: 针对于多个城市的最短距离问题或旅行商问题,模拟退火算法,C#程序-For the shortest distance problem or traveling salesman problem in many cities, simulated annealing algorithm, C# program
Platform: | Size: 67584 | Author: py | Hits:

[matlabTSP_SA

Description: this program is used to solve Travel Salesman Problem (TSP) problem with Simulated Annealing method
Platform: | Size: 1024 | Author: akbar12 | Hits:

[OtherGPU-SA-TSP-DMCC-91

Description: 利用GPU进行多线程的旅行商问题的解决方法,采用的算法为退火算法-The use of multi-threaded GPU solutions traveling salesman problem, the algorithm used for the annealing algorithm
Platform: | Size: 5761024 | Author: 黄晓航 | Hits:

[Other111

Description: 本研究开发一种混合自动进化模糊学习算法 决定了最优路径旅行附近大规模旅行商问题 (LSTSPs)。LSTSPs识别解决方案是一种最复杂的主题 全球的组合优化问题。提出的混合进化模糊 学习计划的优点结合自适应模糊c均值(FCM),简单 不等式性质合并的概念,模拟退火(SA)算法和一种有效的学习 表transform-based粒子群优化(TPSO)。本研究使用 方法来处理大型TSP路由系统。 应用进化TPSO学习算法-This study develops a hybrid evolutionary fuzzy learning algorithm that automatically determines the near optimal traveling path in large-scale traveling salesman problems (LSTSPs). Identifying solutions for LSTSPs is one of the most complicated topics in the field of global combinatorial optimization problems. The proposed hybrid evolutionary fuzzy learning scheme combines the advantages of the adaptive fuzzy C-means (FCM), simple MAX–MIN merging concept, simulated annealing (SA) learning algorithm and an efficient table transform-based particle swarm optimization (TPSO). This study uses the proposed method to deal with the large-size TSP routing system.
Platform: | Size: 1965056 | Author: qi | Hits:

[OtherCodes

Description: solved traveling salesman problem with Simulated Annealing in matlab
Platform: | Size: 4096 | Author: qwe | Hits:

[Othermonituihuo

Description: 利用模拟退火算法解决旅行商问题,显著提高算法的运算效率。-Using simulated annealing algorithm to solve the traveling salesman problem, significantly improving operational efficiency of the algorithm.
Platform: | Size: 3072 | Author: wyzhao | Hits:
« 1 2 3 4 5 6 7 89 »

CodeBus www.codebus.net